On independent doubly chorded cycles
نویسندگان
چکیده
In a graph G, we say a cycle C : v1, v2, . . . , vk, v1 is chorded if its vertices induce an additional edge (chord) which is not an edge of the cycle. The cycle C is doubly chorded if there are at least two such chords. In this paper we show a sharp degree sum condition that implies the existence of k vertex disjoint doubly chorded cycles in a graph. © 2015 Elsevier B.V. All rights reserved.
منابع مشابه
Chorded Cycles
A chord is an edge between two vertices of a cycle that is not an edge on the cycle. If a cycle has at least one chord, then the cycle is called a chorded cycle, and if a cycle has at least two chords, then the cycle is called a doubly chorded cycle. The minimum degree and the minimum degree-sum conditions are given for a graph to contain vertex-disjoint chorded (doubly chorded) cycles containi...
متن کاملIndependent cycles and chorded cycles in graphs
In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply that a graph contains k independent cycles or chorded cycles. This is related to several results of Corrádi and Hajnal, Justesen, Wang, and Faudree and Gould on graphs containing k independent cycles, and Finkel on graphs containing k chorded cycles. In particular, we establish that if in...
متن کاملDisjoint Chorded Cycles of the Same Length
Corrádi and Hajnal [1] showed that any graph of order at least 3k with minimum degree at least 2k contains k vertex-disjoint cycles. This minimum degree condition is sharp, because the complete bipartite graph K2k−1,n−2k+1 does not contain k vertex-disjoint cycles. About the existence of vertex-disjoint cycles of the same length, Thomassen [4] conjectured that the same minimum degree condition ...
متن کاملDisjoint Cycles and Chorded Cycles in Graphs
Very recently, Bialostocki et al. proposed the following conjecture. Let r, s be two nonnegative integers and let G = (V (G), E(G)) be a graph with |V (G)| ≥ 3r + 4s and minimum degree δ(G) ≥ 2r + 3s. Then G contains a collection of r cycles and s chorded cycles, all vertex-disjoint. We prove that this conjecture is true.
متن کاملDisjoint chorded cycles in graphs
We propose the following conjecture to generalize results of Pósa and Corrádi Hajnal. Let r, s be nonnegative integers and let G be a graph with |V (G)| ≥ 3r + 4s and minimal degree δ(G) ≥ 2r + 3s. Then G contains a collection of r + s vertex disjoint cycles, s of them with a chord. We prove the conjecture for r = 0, s = 2 and for s = 1. The corresponding extremal problem, to find the minimum n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015